Distributed Convergence Verification for Gaussian Belief Propagation
نویسندگان
چکیده
Gaussian belief propagation (BP) is a computationally efficient method to approximate the marginal distribution and has been widely used for inference with high dimensional data as well as distributed estimation in large-scale networks. However, the convergence of Gaussian BP is still an open issue. Though sufficient convergence conditions have been studied in the literature, verifying these conditions requires gathering all the information over the whole network, which defeats the main advantage of distributed computing by using Gaussian BP. In this paper, we propose a novel sufficient convergence condition for Gaussian BP that applies to both the pairwise linear Gaussian model and to Gaussian Markov random fields. We show analytically that this sufficient convergence condition can be easily verified in a distributed way that satisfies the network topology constraint.
منابع مشابه
Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation
In networks such as the smart grid, communication networks, and social networks, local measurements/observations are scattered over a wide geographical area. Centralized inference algorithm are based on gathering all the observations at a central processing unit. However, with data explosion and ever-increasing network sizes, centralized inference suffers from large communication overhead, heav...
متن کاملConvergence Analysis of Belief Propagation on Gaussian Graphical Models
Gaussian belief propagation (GBP) is a recursive computation method that is widely used in inference for computing marginal distributions efficiently. Depending on how the factorization of the underlying joint Gaussian distribution is performed, GBP may exhibit different convergence properties as different factorizations may lead to fundamentally different recursive update structures. In this p...
متن کاملConvergence of Min-Sum Message Passing for Quadratic Optimization
We establish the convergence of the min-sum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation.
متن کاملConvergence of the Min-Sum Message Passing Algorithm for Quadratic Optimization
We establish the convergence of the min-sum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation.
متن کاملGaussian Belief Propagation: Theory and Aplication
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we develop a solution based upon Gaussian belief propagation (GaBP) that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.09888 شماره
صفحات -
تاریخ انتشار 2017